Spread-Spectrum Computation
نویسندگان
چکیده
We observe that existing methods for failure-tolerance are inefficient in their use of time, storage and computational resources. We aim to harness the power of idle desktop computers for data-parallel computations, which are particularly sensitive to failure, and propose spreadspectrum computation as a suite of techniques to mitigate failures in an internet-scale distributed system. Spread-spectrum computation will use computation dispersal algorithms to add redundancy to computations, in order that they may tolerate a particular failure distribution. In this position paper, we introduce computation dispersal algorithms, providing examples of their implementation and applications.
منابع مشابه
Stability Diagrams for Landau Damping
Coherent modes which are present when there is no incoherent tune spread may be absent when such a spread exists. Such modes are “Landau damped.” There is instead an incoherent spectrum, a continuum of an infinite number of frequencies, which will decohere (filament), thus not leading to collective instabilities. A stability diagram indicates when Landau damping will be effective. It divides th...
متن کاملOptimum decoder for multiplicative spread spectrum image watermarking with Laplacian modeling
This paper investigates the multiplicative spread spectrum watermarking method for the image. The information bit is spreaded into middle-frequency Discrete Cosine Transform (DCT) coefficients of each block of an image using a generated pseudo-random sequence. Unlike the conventional signal modeling, we suppose that both signal and noise are distributed with Laplacian distribution, because the ...
متن کاملDesign of a High Range, High Efficiency Spread Spectrum Transmitter for Audio Communication Applications
This work proposes a direct sequence spread spectrum transmitter with high transmission range and efficiency for audio signals. It is shown that by choosing high process gain for spread spectrum signal the data could reach a range of 55km in the 2.4GHz ISM band. By employing a light modulation scheme, we have a relaxed SNR requirement for having a low bit error rate (BER) which translates to re...
متن کاملComputer-Aided Modeling of Spread Spectrum Packet Radio Networks
Closed-form expressions for the performance of radio networks are generally not available. For spread spectrum networks, it is not even clear how to represent the underlying network, since the existence of links is heavily dependent on activity in other parts of the network. We have developed a set of computer-based modeling tools to help understand the performance and behavior of these network...
متن کاملSpread-spectrum vs. quantization-based data hiding: misconceptions and implications
The performance of quantization-based data hiding methods is commonly analyzed by assuming a flat probability density function for the host signal, i.e. uniform inside each quantization cell and with its variance large enough to assuming that all the centroids occur with equal probability. This paper comes to fill a gap in watermarking theory, analyzing the exact performance of the Scalar Costa...
متن کامل